On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers
نویسنده
چکیده
منابع مشابه
Optimal Routing to Parallel Heterogeneous Servers- Small Arrival Rates
Abstmct-Consider a set of k( 22) heterogeneous and exponential servers which operate in parallel. Customers arrive into a single infinite capacity buffer according to a Poisson process, and are routed to available servers in accordance with some routing policy. We show that for arrival rates in some positive interval (0, XO], every routing policy which minimizes the long-run expected holding co...
متن کاملMRRK-SRPT: a Scheduling Policy for Parallel Servers
For a system with a dispatcher and several identical servers in parallel, we propose a policy consisting of modified multi-layered round robin routing followed by shortest remaining processing time scheduling. We show that this policy has a heavy traffic limit that is identical to one in which there is a single queue (no routing) and optimal scheduling. Under light traffic, this policy is asymp...
متن کاملMaximizing throughput in finite-source parallel queue systems
Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogenous, we demonstrate that the Shortest Qu...
متن کاملAsymptotic Optimality of Balanced Routing
Consider a system with K parallel single-servers, each with its own waiting room. Upon arrival, a job is to be routed to the queue of one of the servers. Finding routing policy that minimizes the total workload in the system is a known difficult problem in general. Even if the optimal policy is identified, the policy would require the full queue length information at the arrival of each job; fo...
متن کاملMulti-layered round robin routing for parallel servers
We study a system of several identical servers in parallel, where a routing decision must be made immediately on a job’s arrival. Jobs arrive according to a Poisson process, with their processing times following a discrete distribution with finite support. The processing time of a job is known on arrival and may be used in the routing decision. We propose a policy consisting of multi-layered ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 21 شماره
صفحات -
تاریخ انتشار 1996